منابع مشابه
Binary Arithmetic for DNA Computers
We propose a (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of DNA strands, where n is the size of the binary string representing the larger of the two numbers. The salient feature of our technique is that the input strands and the output strands have exactly the same structure which makes it fully procedural unlike most m...
متن کاملHardware Based Binary Arithmetic Engine
Context Based Binary Arithmetic Coding (CBAC) is a part of JZ profile of Audio Video Coding Standard (AVS).The goal of this paper is to present the efficient hardware based binary arithmetic coder which is the main part of binarisation involved in CBAC of AVS. This paper explains about the efficient arithmetic coding involved in the video transcoding. The major concerns of using JZ profile of A...
متن کاملArithmetic Constructions Of Binary Self-Dual Codes
The goal of this thesis is to explore the interplay between binary self-dual codes and the \'etale cohomology of arithmetic schemes. Three constructions of binary self-dual codes with arithmetic origins are proposed and compared: Construction $\Q$, Construction G and the Equivariant Construction. In this thesis, we prove that up to equivalence, all binary self-dual codes of length at least $4$ ...
متن کاملRandom Access Decompression Using Binary Arithmetic Coding
We present an algorithm based on arithmetic coding that allows decompression to start at any point in the compressed le. This random access requirement poses some restrictions on the implementation of arithmetic coding and on the model used. Our main application area is executable code compression for computer systems where machine instructions are decompressed on-they before execution. We focu...
متن کاملNew Arithmetic Residue to Binary Converters
The residue number system (RNS) is a carry-free number system which can support high-speed and parallel arithmetic. Two major issues in efficient design of RNS systems are the moduli set selection and the residue to binary conversion. In this paper, we present two efficient residue to binary converters for the new three-moduli set {2, 2 + 1, 2 – 1}. This moduli set consists of pairwise relative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer
سال: 2007
ISSN: 0018-9162
DOI: 10.1109/mc.2007.196